Integrated Scheduling of Tasks and Messages in Distributed Real-Time Systems

نویسندگان

  • G. Manimaran
  • Shashidhar Merugu
  • Anand Manikutty
  • C. Siva Ram Murthy
چکیده

The scheduling of tasks in distributed real-time systems has attracted many researchers in the recent past. The distributed real-time system considered here consists of uniprocessor or multiprocessor nodes connected through a multihop network. Scheduling in such a system involves scheduling of dynamically arriving tasks within a node (local scheduling) and migration of tasks across the network (global scheduling) if it is not possible to schedule them locally. Most of the existing schemes on distributed real-time task scheduling ignore the underlying message scheduling required for global scheduling of tasks. These schemes consider the load on the processors at a node as the basis to migrate tasks from a heavily loaded node (sender) to a lightly loaded node (receiver). We believe that the identification of a receiver node should be based not only on the load on its processors, but also on the availability of a lightly loaded path from the sender to that receiver. In this paper, we present an integrated framework for distributed realtime dynamic task scheduling (i) by proposing algorithms for transfer, location, and information policies which take into account the states of both the processors and the links, and (ii) by proposing interactions among these policies and schedulers so that the guarantee ratio (ratio of number of tasks guaranteed to the number of tasks arrived) is improved as compared to algorithms where only local scheduling is done. For local scheduling, we use a variation of myopic algorithm [10]. The effectiveness of the proposed framework has been evaluated through simulation. This work was supported by the Department of Science and Technology, New Delhi.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integrated Scheduling of Electric Vehicles and Demand Response Programs in a Smart Microgrid

Microgrid (MG) is one of the important blocks in the future smart distribution systems. The scheduling pattern of MGs affects distribution system operation. Also, the optimal scheduling of MGs will be result in reliable and economical operation of distribution system. In this paper, an operational planning model of a MG which considers multiple demand response (DR) programs is proposed. In the ...

متن کامل

Optimized Deadline Assignment and Schedulability Analysis for Distributed Real-Time Systems with Local EDF Scheduling

The assignment of scheduling parameters under the Earliest Deadline First (EDF) scheduling policy is trivial in single processor systems because deadlines are used directly. However, it is still difficult to find a feasible deadline assignment for EDF distributed systems when the utilization levels of the CPUs and communication networks are pushed near to their limits. Most distributed applicat...

متن کامل

Safety Verification of Real Time Systems Serving Periodic Devices

In real-time systems response to a request from a controlled object must be correct and timely. Any late response to a request from such a device might lead to a catastrophy. The possibility of a task overrun, i.e., missing the deadline for completing a requested task, must be checked and removed during the design of such systems. Safe design of real-time systems running periodic tasks under th...

متن کامل

Replica Determinism and Flexible Scheduling in Hard Real-Time Dependable Systems

ÐFault-tolerant real-time systems are typically based on active replication where replicated entities are required to deliver their outputs in an identical order within a given time interval. Distributed scheduling of replicated tasks, however, violates this requirement if on-line scheduling, preemptive scheduling, or scheduling of dissimilar replicated task sets is employed. This problem of in...

متن کامل

Dynamic End-to-End Guarantees in Distributed Real Time Systems

Many distributed real-time applications are structured as a set of processes communicating through synchronous channels. Unfortunately, process interactions and especially synchronous communications make the problem of predictably scheduling the tasks more complex. In distributed systems the local and remote tasks as well as the messages over the network must be properly scheduled and synchroni...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Scalable Computing: Practice and Experience

دوره 1  شماره 

صفحات  -

تاریخ انتشار 1998